Computational models for search and discrimination

نویسندگان

  • Anthony C. Copeland
  • Mohan M. Trivedi
چکیده

Anthony C. Copeland Mohan M. Trivedi University of California, San Diego Computer Vision and Robotics Research (CVRR) Laboratory Electrical and Computer Engineering Department La Jolla, California 92093-0407 E-mail: [email protected] E-mail: [email protected] Abstract. We present an experimental framework for evaluating metrics for the search and discrimination of a natural texture pattern from its background. Such metrics could help identify preattentive cues and underlying models of search and discrimination, and evaluate and design camouflage patterns and automatic target recognition systems. Human observers were asked to view image stimuli consisting of various target patterns embedded within various background patterns. These psychophysical experiments provided a quantitative basis for comparison of human judgments to the computed values of target distinctness metrics. Two different experimental methodologies were utilized. The first methodology consisted of paired comparisons of a set of stimuli containing targets in a fixed location known to the observers. The observers were asked to judge the relative target distinctness for each pair of stimuli. The second methodology involved stimuli in which the targets were placed in random locations unknown to the observer. The observers were asked to search each image scene and identify suspected target locations. Using a prototype eye tracking testbed, the integrated testbed for eye movement studies, the observers’ fixation points during the experiment were recorded and analyzed. For both experiments, the level of correlation with the psychophysical data was used as the basis for evaluating target distinctness metrics. Overall, of the set of target distinctness metrics considered, a metric based on a model of image texture was the most strongly correlated with the psychophysical data. © 2001 Society of PhotoOptical Instrumentation Engineers. [DOI: 10.1117/1.1390297]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Kullback-Leibler distance for performance evaluation of search designs

This paper considers the search problem, introduced by Srivastava cite{Sr}. This is a model discrimination problem. In the context of search linear models, discrimination ability of search designs has been studied by several researchers. Some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possibl...

متن کامل

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm

In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...

متن کامل

Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms

   In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...

متن کامل

Modified Goal Programming Approach for Improving the Discrimination Power and Weights Dispersion

Data envelopment analysis (DEA) is a technique based on linear programming (LP) to measure the relative efficiency of homogeneous units by considering inputs and outputs. The lack of discrimination among efficient decision making units (DMUs) and unrealistic input-outputs weights have been known as the drawback of DEA. In this paper the new scheme based on a goal programming data envelopment an...

متن کامل

P115: A Novel High Tech Approach to Monitor the Pharmacotherapy of Alzheimer; a Narrative Review

Alzheimer's disease (AD) is multisystem and multifactor disease with a long no-symptom stage. We propose that a more effective approach to use fMRI as a still emerging, repeatable, non- invasive neuroimaging tools that can be very useful for evaluating, diagnosis, treatment and drugs- development. We studied 30 articles which published between 2008-2017 that included the effects of different bi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001